Parametric-surface adaptive tessellation based on degree reduction
نویسندگان
چکیده
Parametric-surface tessellation is one of the most important algorithms for CAGD applications. This paper presents a new parametric-surface tessellation method based on degree reduction: (1) a given parametric surface (or NURBS surface) of degrees (p; q) is decomposed into a set of Bezier surfaces, (2) the Bezier surfaces are converted into a set of bilinear surfaces by applying consecutive stepwise degree reduction processes combined with adaptive subdivision—in each degree reduction step, a Bezier surface is adaptively subdivided until the approximation error from degree reduction is smaller than the corresponding step tolerance, (3) the bilinear surfaces are converted into a triangular net. The proposed method guarantees the resulting piecewise-planar approximant to deviate from the original parametric surface within a pre-defined tolerance, and to form a ‘‘topologically’’ water-tight triangular net. r 2002 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Semi-uniform, 2-Different Tessellation of Triangular Parametric Surfaces
With a greater number of real-time graphics applications moving over to parametric surfaces from the polygonal domain, there is an inherent need to address various rendering bottlenecks that could hamper the move. Scaling the polygon count over various hardware platforms becomes an important factor. Much control is needed over the tessellation levels, either imposed by the hardware limitations ...
متن کاملFractional Reyes-Style Adaptive Tessellation for Continuous Level of Detail
In this paper we present a fractional parametric splitting scheme for Reyes-style adaptive tessellation. Our parallel algorithm generates crack-free tessellation from a parametric surface, which is also free of sudden temporal changes under animation. Continuous level of detail is not addressed by existing Reyes-style methods, since these aim to produce subpixel-sized micropolygons, where topol...
متن کاملNear-Optimum Adaptive Tessellation of General Catmull-Clark Subdivision Surfaces
A new adaptive tessellation method for general CatmullClark subdivision surfaces is presented. Development of the new method is based on the observation that optimum adaptive tessellation for rendering purpose is a recursive error evaluation and globalization process. The adaptive tessellation process is done by generating an inscribing polyhedron to approximate the limit surface for each indiv...
متن کاملSurface Segmentation and Polycube Construction Based on Generalized Centroidal Voronoi Tessellation
In this paper, we first develop a centroidal Voronoi tessellation (CVT) based surface segmentation algorithm using eigenfunctions of the Secondary Laplace operator (SLO). We then present a novel automatic polycube construction algorithm based on a generalized harmonic boundary-enhanced CVT (gHBECVT) by including the curve-skeleton information. Based on the constructed polycube, we generate qual...
متن کاملInscribed Approximation based Adaptive Tessellation of Catmull-Clark Subdivision Surfaces
Catmull-Clark subdivision scheme provides a powerful method for building smooth and complex surfaces. But the number of faces in the uniformly refined meshes increases exponentially with respect to subdivision depth. Adaptive tessellation reduces the number of faces needed to yield a smooth approximation to the limit surface and, consequently, makes the rendering process more efficient. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Graphics
دوره 26 شماره
صفحات -
تاریخ انتشار 2002